Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory
نویسندگان
چکیده
Abstract Aggregates provide a concise way to express complex knowledge. The problem of selecting an appropriate formalization aggregates for answer set programming (ASP) remains unsettled. This paper revisits it from the viewpoint Approximation Fixpoint Theory (AFT). We introduce AFT equivalent with Gelfond–Lifschitz reduct basic ASP programs and we extend handle aggregates. analyze how existing approaches relate our framework. hope this work sheds some new light on issue proper
منابع مشابه
Semantics for Active Integrity Constraints Using Approximation Fixpoint Theory
Active integrity constraints (AICs) constitute a formalism to associate with a database not just the constraints it should adhere to, but also how to fix the database in case one or more of these constraints are violated. The intuitions regarding which repairs are “good” given such a description are closely related to intuitions that live in various areas of non-monotonic reasoning. In this pap...
متن کاملAnalyzing Security Scenarios Using Defence Trees and Answer Set Programming
Defence trees are used to represent attack and defence strategies in security scenarios; the aim in such scenarios is to select the best set of countermeasures that are able to stop all the vulnerabilities. In order to represent preferences among possible countermeasures of a given attack, defence trees are enriched with conditional preferences, obtaining a new structure called CP-defence tree....
متن کاملA Tarskian Semantics for Answer Set Programming
Extended logic programming was introduced initially as an epistemic logic for default and autoepistemic reasoning. With time the reasons for interest in the language have shifted. In 1999 extended logic programming was proposed as the basis of the answer-set programming (ASP) paradigm for modeling and solving search problems and in that role the language is primarily used now. However, in the n...
متن کاملCharacterizing and extending answer set semantics using possibility theory
Answer Set Programming (ASP) is a popular framework for modeling combinatorial problems. However, ASP cannot easily be used for reasoning about uncertain information. Possibilistic ASP (PASP) is an extension of ASP that combines possibilistic logic and ASP. In PASP a weight is associated with each rule, where this weight is interpreted as the certainty with which the conclusion can be establish...
متن کاملVoting Theory in Answer Set Programming
In this paper, we combine answer set programming with voting theory for the first time. For this, we use the voting procedures defined in [5], which allow winner determination under incomplete preference relations. We present the problem of scheduling a meeting for a research group as an application. In those scheduling problems, often no meetings are schedulable because of conflicting unavaila...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory and Practice of Logic Programming
سال: 2022
ISSN: ['1471-0684', '1475-3081']
DOI: https://doi.org/10.1017/s1471068422000126